#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 10;

int n;
int a[N];
int res = 1;
int ans;

int main()
{
	freopen("duel.in", "r", stdin);
	freopen("duel.out", "w", stdout);
	
	cin >> n;
	
	for (int i = 1; i <= n; ++ i )
		cin >> a[i];
		
	sort(a + 1, a + 1 + n);
	
	for (int i = 1; i <= n; ++ i )
	{
		if (a[i] == a[i + 1]) res ++;
		else {
			ans = max(ans, res);
			res = 1;
		}
	}	
	
	cout << ans << endl;
	
	return 0;
}
